Is the language A = {0^n 1^n 0^n} context free?

Posted by Tony on Stack Overflow See other posts from Stack Overflow or by Tony
Published on 2010-04-11T19:35:46Z Indexed on 2010/04/11 19:43 UTC
Read the original article Hit count: 179

Hi, I was just putting some thought into different languages (as I'm reviewing for final exams coming up) and I can not think of a valid pushdown automata to handle the language A = {0^n 1^n 0^n | n >= 0}. This is not a context-free language, am I correct?

© Stack Overflow or respective owner

Related posts about computer-science

Related posts about context-free-grammar